for _ in range(int(input())):
n = int(input())
l = [n-1,n]
ans = [i for i in range(n-2,0,-1)]
if len(ans)%2==1:
ans = [ans[-1]]+ans[:-1]
ans.extend(l)
print(*ans)#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
if(n%2!=0)
{
cout<<1<<" "<<2<<" "<<3<<" ";
for(int i=n-2;i>3;i--)
{
cout<<i<<" ";
}
cout<<n-1<<" "<<n<<endl;
}
else
{
for(int i=n-2;i>0;i--)
{
cout<<i<<" ";
}
cout<<n-1<<" "<<n<<endl;
}
}
}
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |
1542B - Plus and Multiply | 306A - Candies |
1651C - Fault-tolerant Network | 870A - Search for Pretty Integers |
1174A - Ehab Fails to Be Thanos | 1169A - Circle Metro |
780C - Andryusha and Colored Balloons | 1153A - Serval and Bus |
1487C - Minimum Ties | 1136A - Nastya Is Reading a Book |
1353B - Two Arrays And Swaps | 1490E - Accidental Victory |